Approximation and the Topology of Rationally Convex Sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation and the Topology of Rationally Convex Sets

Considering a mapping g holomorphic on a neighbourhood of a rational convex set K ⊂ C, and range into the complex projective space CP, the main objective of this paper is to show that we can uniformly approximate g on K by rational mappings defined from C into CP. We only need to ask that the second Čech cohomology group Ȟ(K, Z) vanishes.

متن کامل

Interpolation and Approximation from Convex Sets

Let X be a topological vector space, Y = IR n , n 2 IN, A a continuous linear map from X to Y , C X, B a convex set dense in C, and d 2 Y a data point. We derive conditions which guarantee that the set B \ A ?1 (d) is nonempty and dense in C \ A ?1 (d). Some applications to shape preserving interpolation and approximation are described.

متن کامل

Blind approximation of planar convex sets

The process of learning the shape of an unknown convex planar object through an adaptive process of simple measurements called Line probings, which reveal tangent lines to the object, is considered. A systematic probing strategy is suggested and an upper bound on the number of probings it requires for achieving an approximation with a pre-specified precision to the unknown object is derived. A ...

متن کامل

On invariant sets topology

In this paper, we introduce and study a new topology related to a self mapping on a nonempty set.Let X be a nonempty set and let f be a self mapping on X. Then the set of all invariant subsets ofX related to f, i.e. f := fA X : f(A) Ag P(X) is a topology on X. Among other things,we nd the smallest open sets contains a point x 2 X. Moreover, we find the relations between fand To f . For insta...

متن کامل

The Digital Topology of Sets of Convex Voxels

Classical digital geometry deals with sets of cubical voxels (or square pixels) that can share faces, edges, or vertices; but basic parts of digital geometry can be generalized to sets S of convex voxels (or pixels) that can have arbitrary intersections. In particular, it can be shown that if each voxel P of S has only finitely many neightbors (voxels of S that intersect P), and if any nonempty...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Canadian Mathematical Bulletin

سال: 2006

ISSN: 0008-4395,1496-4287

DOI: 10.4153/cmb-2006-058-2